A new extension theorem for linear codes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semigroup Rings and the Extension Theorem for Linear Codes

An extension theorem for general weight functions is proved over nite commutative local principal ideal rings. The structure of the complex semigroup ring associated to the multiplicative semigroup of the ring plays a prominent role in the proof. 1. Background In her doctoral dissertation, MacWilliams [8], [9] proved an equivalence theorem: two linear codes C1; C2 F n de ned over a nite eld F a...

متن کامل

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...

15 صفحه اول

A New Extension Theorem for Concave Operators

We present a new and interesting extension theorem for concave operators as follows. Let X be a real linear space, and let Y,K be a real order complete PL space. Let the setA ⊂ X × Y be convex. Let X0 be a real linear proper subspace of X, with θ ∈ AX −X0 , where AX {x | x, y ∈ A for some y ∈ Y}. Let g0 : X0 → Y be a concave operator such that g0 x ≤ z whenever x, z ∈ A and x ∈ X0. Then there e...

متن کامل

Contemporary Mathematics Weight Functions and the Extension Theorem for Linear Codes over Finite Rings

An extension theorem for general weight functions is proved over nite chain rings. The structure of the complex semigroup ring associated to the multiplicative semigroup of the ring plays a prominent role in the proof.

متن کامل

(l, S)-extension of Linear Codes

We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n, k. Among these new codes there is an optimal ternary [88, 8, 54]3 code. We develop an algorithm, which starts with already good codes C , i.e. codes with high minimum distance d for given length n and dimensio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2004

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2004.02.001